NP-complete problems

Results: 1536



#Item
71Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Electronic design automation / Algebraic logic / Tseytin transformation / Boolean satisfiability problem / Conjunctive normal form / Canonical normal form

Microsoft Word - IBSdoc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-02-02 08:44:10
72Graph theory / NP-complete problems / Ear decomposition / Matroid theory / Graph / Dominating set / Chordal graph / Graph coloring / Line graph / Expander graph

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-05-11 15:56:58
73Computer programming / Mathematics / Software engineering / Graph connectivity / Connectivity / Tree traversal / Search algorithms / NP-complete problems / Biconnected component / HopcroftKarp algorithm

Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis

Add to Reading List

Source URL: cgm.cs.mcgill.ca

Language: English - Date: 2013-11-01 11:17:39
74Graph theory / Mathematics / Algebraic graph theory / Matrices / Adjacency matrix / Regular graph / Graph coloring / NP-complete problems / Two-graph / Expander graph

The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2010-11-16 11:14:05
75Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / NP-hard problems / Approximation algorithms / Edsger W. Dijkstra / Travelling salesman problem / Nearest neighbour algorithm / Shortest path problem / Maximal independent set

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:12
76Mathematics / Computational complexity theory / Graph theory / Analysis of algorithms / NP-complete problems / Probabilistic complexity theory / Combinatorics / Randomized algorithm / Rejection sampling / NP / Independent set / Poisson distribution

Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:52
77Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Approximation algorithms / Combinatorial optimization / Set cover problem / Linear programming relaxation / Greedy algorithm / Facility location problem / Reduction

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Add to Reading List

Source URL: users.eecs.northwestern.edu

Language: English - Date: 2009-09-15 22:21:32
78Graph theory / NP-complete problems / Hamiltonian path / Cycle / Hamiltonian / Zero-knowledge proof / Hamiltonian path problem

Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture) Hamiltonian cycles

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-03-30 06:00:41
79Graph theory / Mathematics / Graph connectivity / Network theory / NP-complete problems / Edsger W. Dijkstra / Shortest path problem / Graph / Path / Hamiltonian path / Distance / Biconnected component

Microsoft PowerPoint - Presentation2

Add to Reading List

Source URL: web.cse.ohio-state.edu

Language: English - Date: 2009-01-27 18:47:33
80Graph theory / Mathematics / NP-complete problems / Graph operations / Graph coloring / Graph / Edge contraction / Longest path problem / Vertex / Cycle / Line graph / Vertex cover

Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:50:25
UPDATE